REASONING ABOUT RECURSIVELY DEFINED DATA STRUCTURES Derek

نویسنده

  • Derek C. Oppen
چکیده

A decision algorithm is given for the quantifier-free theory of recursively defined data structures which, for a conjunction of length n, decides its satisfiability in time linear in n. The first-order theory of recursively defined data structures, in particular the first-order theory of LISP list structure {the theory of CONS, CAR and CDR), is shown to be decidable but not elementary recursive. Foundation under contract MCS 76-000327.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Separation Logic with First-Class Heaps and a New Frame Rule

Separation Logic brought an advance to program verification of data structures through its use of (recursively defined) predicates to implicitly represent heaps, and the separation operator to construct heaps from disjoint subheaps. While this facilitated local reasoning in program fragments, the consideration of subheaps that are disjoint meant that any form of sharing between predicates is pr...

متن کامل

On automated reasoning about recursively defined functions and homomorphisms

We study possibilities of reasoning about extensions of base theories with functions which satisfy certain recursion (or homomorphism) properties. Our focus is on emphasizing possibilities of hierarchical and modular reasoning in such extensions and combinations thereof. We present practical applications in verification and cryptography.

متن کامل

Composition Theorems for Generalized Sum and Recursively Defined Types

Composition theorems are tools which reduce reasoning about compound data structures to reasoning about their parts. For example, the truth value of a sentence about the Cartesian product of two structures can be reduced to the truth values of sentences on the components of the product. A seminal example of a compositional theorem is the Feferman-Vaught Theorem [2]. Feferman and Vaught introduc...

متن کامل

Nested Hoare Triples and Frame Rules for Higher-Order Store

Separation logic is a Hoare-style logic for reasoning about programs withheap-allocated mutable data structures. As a step toward extending separation logic tohigh-level languages with ML-style general (higher-order) storage, we investigate the com-patibility of nested Hoare triples with several variations of higher-order frame rules.The interaction of nested triples and frame r...

متن کامل

A Step-Indexed Kripke Model of Hidden State via Recursive Properties on Recursively Defined Metric Spaces

Frame and anti-frame rules have been proposed as proof rules for modular reasoning about programs. Frame rules allow one to hide irrelevant parts of the state during verification, whereas the anti-frame rule allows one to hide local state from the context. We give the first sound model for Charguéraud and Pottier’s type and capability system including both frame and anti-frame rules. The model ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998